A Note on Correctly Gathering Results from JR's Concurrent Invocation Statement

An Exception Handling Mechanism for the Concurrent Invocation Statement

Several concurrent programming languages and systems — e.g., MPI, .NET, and SR — provide mechanisms to facilitate communication between one process and a group of others. One such mechanism is SR’s concurrent invocation statement (co statement). It specifies a group of operation invocations and normally terminates when all of its invocations have completed. To make the co statement more flexibl...

Assembling Concurrent Programs Correctly from Data-Parallel Program Bricks

In this position paper, we advocate functional array programming in conjunction with automatic verification to economically harness the power of modern multi-core processors. Array operations often apply scalar operations uniformly to large numbers of array elements. Thus, their execution can be shared between multiple processing units. Using mechanisms such as functional composition, concurren...

Intelligent Information Gathering: A Research Statement

As computational devices and entities become further established as routine, omnipresent components of our everyday lives (e.g., wearable sensors, smart homes, cyber-physical systems, embodied agents, human-robot interactions), such systems will face an increased pressure to successfully and perpetually understand the complex, noisy, uncertain world around them in realtime. Properly understandi...

A Note on Concurrent Graph Sharing Games

In the concurrent graph sharing game, two players, called 1st and 2nd, share the vertices of a connected graph with positive vertex-weights summing up to 1 as follows. The game begins with 1st taking any vertex. In each proceeding round, the player with the smaller sum of collected weights so far chooses a non-taken vertex adjacent to a vertex which has been taken, i.e., the set of all taken ve...

Statement: One of Block Synchronized Invocation Assignment Creation